A Penalty Function Promoting Sparsity Within and Across Groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proximal Mapping for Symmetric Penalty and Sparsity

This paper studies a class of problems consisting of minimizing a continuously differentiable function penalizedwith the so-called `0-norm over a symmetric set. These problems are hard to solve, yet prominent in many fields and applications.We first study the proximal mapping with respect to the `0-norm over symmetric sets, and provide an efficient method to attainit. The method is ...

متن کامل

Structured sparsity with convex penalty functions

We study the problem of learning a sparse linear regression vector under additional conditions on the structure of its sparsity pattern. This problem is relevant in Machine Learning, Statistics and Signal Processing. It is well known that a linear regression can benefit from knowledge that the underlying regression vector is sparse. The combinatorial problem of selecting the nonzero components ...

متن کامل

Sparsity-promoting dynamic mode decomposition

Sparsity-promoting dynamic mode decomposition Mihailo R. Jovanović,1,a) Peter J. Schmid,2,b) and Joseph W. Nichols3,c) 1Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, Minnesota 55455, USA 2Laboratoire d’Hydrodynamique (LadHyX), Ecole Polytechnique, 91128 Palaiseau cedex, France 3Department of Aerospace Engineering and Mechanics, University of Minnesota,...

متن کامل

A Family of Penalty Functions for Structured Sparsity

We study the problem of learning a sparse linear regression vector under additional conditions on the structure of its sparsity pattern. We present a family of convex penalty functions, which encode this prior knowledge by means of a set of constraints on the absolute values of the regression coefficients. This family subsumes the l1 norm and is flexible enough to include different models of sp...

متن کامل

Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs

This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2017

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2017.2709260